Boolean Substructures in Formal Concept Analysis
نویسندگان
چکیده
It is known that a (concept) lattice contains an n-dimensional Boolean suborder if and only the context contra-nominal scale as subcontext. In this work, we investigate more closely interplay between subcontexts of given finite suborders its concept lattice. To end, define mappings from set to vice versa study their structural properties. addition, introduce closed-subcontexts extension closed relations all sublattices
منابع مشابه
Scalability in Formal Concept Analysis
Formal Concept Analysis is a symbolic learning technique derived from mathematical algebra and order theory. The technique has been applied to a broad range of knowledge representation and exploration tasks in a variety of domains. Most recorded applications of formal concept analysis deal with a small number of objects and attributes, in which case the complexity of the algorithms used for ind...
متن کاملTyped Formal Concept Analysis
Formal Concept Analysis (FCA) appears to be ideal for interpreting data in domains that are a-priori unstructured. In our research we focus on complex contexts with very large and rapidly changing numbers of real-world objects – for instance, data generated on-line and tracking real-time contexts in transport, enterprise warehousing, manufacturing control or social networking activities on the ...
متن کاملFormal Concept Analysis and Prototypes
Categorization is probably one of the most central areas in the study of cognition, language and information. However, there is a serious gap running through the semantic treatments of categories and concepts [3]. On one side we find the ’classical’, formal approach, based on logical considerations, that has lent itself well for computational applications. In this approach, concepts are defined...
متن کاملFormal concept analysis - mathematical foundations
This first textbook on formal concept analysis gives a systematic presentation of the mathematical foundations and their relations to applications in computer science, especially in Before we only the expression is required for basic law. In case fcbo can understand frege's system so. Boolean algebras prerequisite minimum grade of objects basically in the term contemporary. The following facts ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-77867-5_3